Weak Arithmetics and Kripke Models
نویسندگان
چکیده
منابع مشابه
Weak Arithmetics and Kripke Models
In the first section of this paper we show that iΠ1 ≡ W¬¬lΠ1. In the second section of the paper, we show that for equivalence of forcing and satisfaction of Πm-formulas in a linear Kripke model deciding ∆0-formulas, it is necessary and sufficient that the model be Σm-elementary. This implies that if a linear Kripke model forces PEMprenex, then it forces PEM . We also show that, for each n > 1,...
متن کاملCorrigendum to "Weak Arithmetics and Kripke Models"
We give a corrected proof of the main result in the paper mentioned in the title. 2000 Mathematics Subject Classification: 03F30, 03F55, 03H15.
متن کاملWeak Kripke Structures and LTL
We revisit the complexity of the model checking problem for formulas of linear-time temporal logic (LTL). We show that the classic PSPACE-hardness result is actually limited to a subclass of the Kripke frames, which is characterized by a simple structural condition: the model checking problem is only PSPACE-hard if there exists a strongly connected component with two distinct cycles. If no such...
متن کاملModels for Substructural Arithmetics
This paper explores models for arithmetics in substructural logics. In the existing literature on substructural arithmetic, frame semantics for substructural logics are absent. We will start to fill in the picture in this paper by examining frame semantics for the substructural logics C (linear logic plus distribution), R (relevant logic) and CK (C plus weakening). The eventual goal is to find ...
متن کاملAutomata-based decision procedures for weak arithmetics
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MLQ
سال: 2002
ISSN: 0942-5616,1521-3870
DOI: 10.1002/1521-3870(200201)48:1<157::aid-malq157>3.3.co;2-v